APPELL'S F4 WITH FINITE IRREDUCIBLE MONODROMY GROUP

Finite p-groups with few non-linear irreducible character kernels

Abstract. In this paper, we classify all of the finite p-groups with at most three non linear irreducible character kernels.

On Finite Groups With Two Irreducible Character Degrees

finite p-groups with few non-linear irreducible character kernels

abstract. in this paper, we classify all of the finite p-groups with at most three non linear irreducible character kernels.

on finite groups with two irreducible character degrees

Irreducible Polynomials over Finite Fields

As we will see, modular arithmetic aids in testing the irreducibility of polynomials and even in completely factoring polynomials in Z[x]. If we expect a polynomial f(x) is irreducible, for example, it is not unreasonable to try to find a prime p such that f(x) is irreducible modulo p. If we can find such a prime p and p does not divide the leading coefficient of f(x), then f(x) is irreducible ...